The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering
نویسندگان
چکیده
منابع مشابه
A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملSet Covering, Packing and Partitioning Problems
where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is call...
متن کاملSolving Set Partitioning Problems with Constraint Programming
This paper investigates the potential of constraint programming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance integer linear programming solvers. We evaluate preprocessing steps known from the OR literature on moderately sized set partitioning problems. Further, we propose a new prep...
متن کاملTighter Representations for Set Partitioning Problems
In this paper, we consider the set partitioning polytope and we begin by applying the reformulation-linearization technique of Sherali and Adams (1990, 1994) to generate a specialized hierarchy of relaxations by exploiting the structure of this polytope. We then show that several known classes of valid inequalities for this polytopc, as well as related tightening and composition rules, are auto...
متن کاملContinuity of the Solution Maps for Generalized Parametric Set-Valued Ky Fan Inequality Problems
Under new assumptions, we provide suffcient conditions for the upper and lower semicontinuity and continuity of the solution mappings to a class of generalized parametric set-valued Ky Fan inequality problems in linear metric space. These results extend and improve some known results in the literature e.g., Gong, 2008; Gong and Yoa, 2008; Chen and Gong, 2010; Li and Fang, 2010 . Some examples a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 1992
ISSN: 0160-5682
DOI: 10.1057/palgrave.jors.0430508